Banach-Mazur Games with Simple Winning Strategies
نویسندگان
چکیده
We discuss several notions of ‘simple’ winning strategies for Banach-Mazur games on graphs, such as positional strategies, move-counting or length-counting strategies, and strategies with a memory based on finite appearance records (FAR). We investigate classes of Banach-Mazur games that are determined via these kinds of winning strategies. Banach-Mazur games admit stronger determinacy results than classical graph games. For instance, all Banach-Mazur games with ω-regular winning conditions are positionally determined. Beyond the ω-regular winning conditions, we focus here on Muller conditions with infinitely many colours. We investigate the infinitary Muller conditions that guarantee positional determinacy for Banach-Mazur games. Further, we determine classes of such conditions that require infinite memory but guarantee determinacy via move-counting strategies, length-counting strategies, and FAR-strategies. We also discuss the relationships between these different notions of determinacy. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
Simple strategies for Banach-Mazur games and fairly correct systems
In 2006, Varacca and Völzer proved that on finite graphs, ω-regular large sets coincide with ωregular sets of probability 1, by using the existence of positional strategies in the related BanachMazur games. Motivated by this result, we try to understand relations between sets of probability 1 and various notions of simple strategies (including those introduced in a recent paper of Grädel and Le...
متن کاملBanach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token through a directed graph, thus tracing out an infinite path, have numerous applications in different branches of mathematics and computer science. In the usual format, the possible moves of the players are given by the edges ...
متن کاملWinning the pressing down game but not Banach-Mazur
Let S be the set of those α ∈ ω2 that have cofinality ω1. It is consistent relative to a measurable that the nonempty player wins the pressing down game of length ω1, but not the Banach Mazur game of length ω+1 (both games starting with S).
متن کاملCovering games and the Banach-Mazur game: k-tactics
Given a free ideal J of subsets of a set X, we consider games where player ONE plays an increasing sequence of elements of the σ-completion of J , and player TWO tries to cover the union of this sequence by playing one set at a time from J . We describe various conditions under which player TWO has a winning strategy that uses only information about the most recent k moves of ONE, and apply som...
متن کاملOnce Upon a Time in the West Determinacy, definability, and complexity of path games⋆
We study determinacy, definability and complexity issues of path games on finite and infinite graphs. Compared to the usual format of infinite games on graphs (such as GaleStewart games) we consider here a different variant where the players select in each move a path of arbitrary finite length, rather than just an edge. The outcome of a play is an infinite path, the winning condition hence is ...
متن کامل